Description: 哲学家进餐算法 一定要成为vip会员,十万火急 站长请通融一下,-algorithm dining philosophers must become the vip members Most Urgent station please bend, thank you Platform: |
Size: 1024 |
Author:hw |
Hits:
Description: 该程序是针对操作系统课程而做的模拟哲学家进餐问题-the program is to the operating system and programs do simulated dining philosophers problem Platform: |
Size: 3072 |
Author:望军 |
Hits:
Description: 本程序是关于哲学家进餐问题的描述,具体可以在javabuilder上运行一下-the procedures of the Dining Philosophers Problem description, concrete can run about javabuilder Platform: |
Size: 1024 |
Author:潘孝有 |
Hits:
Description: ucosii小实验任务3 哲学家就餐，可以帮助学习嵌入式操作系统-ucosii small experimental task three dining philosophers can help embedded operating system Platform: |
Size: 106496 |
Author:yz |
Hits:
Description: 经典进程同步和互斥另类WINDOWS解法.定义信号量机制在WINDOWS下完成哲学家进餐问题.-classical process synchronization and mutex WINDOWS alternative solution. Volume definition signal mechanism in Windows complete the dining philosophers problem. Platform: |
Size: 1024 |
Author: |
Hits:
Description: 摘 要:通过一个经典的多任务同步哲学家进餐问题。介绍了Vxworks下的多任务程序设计和任务间通信机制，并给出了运行的结果
-Abstract : Through a classic multi-task synchronization dining philosophers problem. Vxworks introduced under the multi-task design and process communication mechanism between tasks, and gives the results of the operation Platform: |
Size: 388096 |
Author:嵇辉辉 |
Hits:
Description: 计算机仿真的实验，用三种方法模拟了哲学家进餐的过程，图形化的显示过程，用VC++.net开发的-computer simulation experiments, using three methods to simulate the process of the Dining Philosophers, graphical display process, VC. net development Platform: |
Size: 582656 |
Author:范孟君 |
Hits:
Description: 用win32函数，模拟了哲学家进餐问题，对于初学多线程编程的理解线程之间的同步和死锁问题很有启发性。-using win32 function to simulate the Dining Philosophers, For novice multithreaded programming understanding thread synchronization between the deadlock and very instructive. Platform: |
Size: 192512 |
Author:chenzc |
Hits:
Description: 美国加州大学操作系统课程实验平台Nachos，在美国非常流行，国内很多大学也采用。-the University of California courses on operating system platform Nachos, very popular in the United States, Many universities have adopted. Platform: |
Size: 259072 |
Author:高云璐 |
Hits:
Description: 这个朋友做的哲学家进餐问题，使用到管程解决死锁问题-friends to do the Dining Philosophers, the use of tube-to resolve deadlock Platform: |
Size: 526336 |
Author:飞灵 |
Hits:
Description: 计算机操作系统哲学家就餐问题的课程设计报告。无解压密码。-computer operating system dining philosophers problem of the design report. No extract passwords. Platform: |
Size: 88064 |
Author:an |
Hits:
Description: 哲学家进餐问题是荷兰学者Dijkstra 提出的经典问题之一,它是一个信号量机制问题的应用,在操作系统文化史上具有非常重要的地位。对该问题的剖析有助于学生深刻地理解计算机系统中的资源共享、进程同步、死锁等问题,并能熟练地应用信号量来解决生活中的控制流程,即将生活中的控制流程用形式化的方式表达出来。
假设有5个哲学家，他们花费一生中的时光思考和吃饭。这些哲学家共用一个圆桌，每个哲学家都有一把椅子。在桌子中央是一碗通心面，在桌子上放着5只筷子。（如图所示）当一个哲学家思考时，他与其他同事不交互。时而，哲学家会感到饥饿，并试图拿起与他相近的两只筷子（他与邻近左、右之间的筷子）。一个哲学家一次只能拿起一只筷子。显然，他不能从其他哲学家手里拿走筷子。当一个饥饿的哲学家同时有两只筷子时，他就不能不用释放他的筷子而自己吃了。当吃完后，他会放下两只筷子，并再次开始思考。
规定奇数号哲学家先拿他左边的筷子，然后再去拿右边的筷子；而偶数号哲学家则相反。按此规定，将是1、 2号哲学家竞争1号筷子；3、4号哲学家竞争3号筷子。即五位哲学家都先竞争奇数号筷子，获得后，再去竞争偶数号筷子，最后总会有一位哲学家能获得两只筷子而进餐。
-dining philosophers problem is the Netherlands scholars Dijkstra's one of the classic, It is a signal to the mechanism of application, the operating system in the history of culture has a very important position. Analysis of the problem to help students understand deeply the computer system resource sharing, process synchronization, and other issues Deadlock, skilled and can be applied to solve the signal volume life of the control flow, about the life of the control flow with the formal expression. Assuming a five philosophers, they spend a lifetime of thought and time to eat. These philosophers sharing a round-table, each have a chair philosopher. The table is a bowl of the Central Link hearts, placed on the table five chopsticks. (As shown) as a philosopher to think that he and othe Platform: |
Size: 84992 |
Author:nicmaters |
Hits:
Description: 哲学家进餐问题是荷兰学者Dijkstra 提出的经典问题之一,它是一个信号量机制问题的应用,在操作系统文化史上具有非常重要的地位。对该问题的剖析有助于学生深刻地理解计算机系统中的资源共享、进程同步、死锁等问题,并能熟练地应用信号量来解决生活中的控制流程,即将生活中的控制流程用形式化的方式表达出来。
假设有5个哲学家，他们花费一生中的时光思考和吃饭。这些哲学家共用一个圆桌，每个哲学家都有一把椅子。在桌子中央是一碗通心面，在桌子上放着5只筷子。（如图所示）当一个哲学家思考时，他与其他同事不交互。时而，哲学家会感到饥饿，并试图拿起与他相近的两只筷子（他与邻近左、右之间的筷子）。一个哲学家一次只能拿起一只筷子。显然，他不能从其他哲学家手里拿走筷子。当一个饥饿的哲学家同时有两只筷子时，他就不能不用释放他的筷子而自己吃了。当吃完后，他会放下两只筷子，并再次开始思考。
规定奇数号哲学家先拿他左边的筷子，然后再去拿右边的筷子；而偶数号哲学家则相反。按此规定，将是1、 2号哲学家竞争1号筷子；3、4号哲学家竞争3号筷子。即五位哲学家都先竞争奇数号筷子，获得后，再去竞争偶数号筷子，最后总会有一位哲学家能获得两只筷子而进餐。
-dining philosophers problem is the Netherlands scholars Dijkstra's one of the classic, It is a signal to the mechanism of application, the operating system in the history of culture has a very important position. Analysis of the problem to help students understand deeply the computer system resource sharing, process synchronization, and other issues Deadlock, skilled and can be applied to solve the signal volume life of the control flow, about the life of the control flow with the formal expression. Assuming a five philosophers, they spend a lifetime of thought and time to eat. These philosophers sharing a round-table, each have a chair philosopher. The table is a bowl of the Central Link hearts, placed on the table five chopsticks. (As shown) as a philosopher to think that he and othe Platform: |
Size: 90112 |
Author:nicmaters |
Hits:
Description: 哲学家进餐问题，里面有动态演示 哲学家进餐的问题，这是操作系统的作业之一-Dining philosophers problem, which philosophers have dynamic presentation of the meal, which is one of the operating system Platform: |
Size: 480256 |
Author:谭 |
Hits:
Description: 这是一个经典算法。关于哲学家进餐问题的源码,是一个很不错的源码。模拟了哲学家进餐问题。-This is a classical algorithm. Dining philosophers problem on the source, is a very good source. Simulated dining philosophers problem. Platform: |
Size: 4096 |
Author:duanhz |
Hits:
Search - dining philosophers